Packing, Tiling, Ortho Preprint Gonality and Completeness
نویسنده
چکیده
Let R d be an open set of measure 1. An open set D R d is called a tight orthogonal packing region for if D ? D does not intersect the zeros of the Fourier Transform of the indicator function of and D has measure 1. Suppose that is a discrete subset of R d. The main contribution of this paper is a new way of proving the folowing result (proved by Lagarias, Reeds and Wang and, in the case of being the cube, by Iosevich and Pedersen): D tiles R d when translated at the locations if and only if the set of exponentials E = fexp 2ih; xi : 2 g is an orthonormal basis for L 2 ((). (When is the unit cube in R d then it is a tight orthogonal packing region of itself.) In our approach orthogonality of E is viewed as statement about packing R d with translates of a certain nonnegative function and E is an orthonormal basis for L 2 (() if and only if the above-mentioned packing is in fact a tiling. We then formulate the tiling condition in Fourier Analytic language and use this to prove our result.
منابع مشابه
A change-of-coordinates from Geometry to Algebra, applied to Brick Tilings
A proof is sketched of the Polynomial Conjecture of the author (circulated as preprint [Kin1], “Brick Tiling and Monotone Boolean Functions”), which says that the family of minimal tilable-boxes grows polynomially with dimension. An important ingredient of the argument is translating the problem from its finite-dimensional geometric framework to the algebraic setting of an in-finite-dimensional...
متن کاملar X iv : m at h / 99 04 06 6 v 1 [ m at h . C A ] 1 4 A pr 1 99 9 Packing , tiling , orthogonality and completeness
Let Ω ⊆ R be an open set of measure 1. An open set D ⊆ R is called a tight orthogonal packing region for Ω if D − D does not intersect the zeros of the Fourier Transform of the indicator function of Ω. Suppose that Λ is a discrete subset of R. The main contribution of this paper is a new way of proving the folowing result (proved by Lagarias, Reeds and Wang and, in the case of Ω being the cube,...
متن کاملEfficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
We provide improved approximation algorithms for several rectangle tiling and packing problems RTILE DRTILE and d RPACK studied in the literature Most of our algorithms are highly e cient since their running times are near linear in the sparse input size rather than in the domain size In addition we improve the best known approximation ratios
متن کاملA Pentagonal Crystal, the Golden Section, Alcove Packing and Aperiodic Tilings
A Lie theoretic interpretation is given to a pattern with five-fold symmetry occurring in aperiodic Penrose tiling based on isosceles triangles with length ratios equal to the Golden Section. Specifically a B(∞) crystal based on that of Kashiwara is constructed exhibiting this five-fold symmetry. It is shown that it can be represented as a Kashiwara B(∞) crystal in type A4. Similar crystals wit...
متن کاملTwo-dimensional packing algorithms for layout of disconnected graphs
We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they pe...
متن کامل